Basis-Adaptive Selection Algorithm in dr-package
نویسندگان
چکیده
منابع مشابه
The dr package
The dr package for R for dimension reduction regression was first documented in Weisberg (2002). This is a revision of that article, to correspond to version 3.0.0 of dr for R added to CRAN (cran.r-project.org) in Fall 2007. Regression is the study of the dependence of a response variable y on a collection of p predictors collected in x. In dimension reduction regression, we seek to find a few ...
متن کاملJoint adaptive space and frequency basis selection
We develop a new method for building a representation of an image from a library of basis elements that is facilitated by a joint adaptive space and frequency (JASF) graph. The JASF graph combines partitionable frequency expansion and spatial segmentation of the image, symmetrically. We demonstrate by using a rate-distortion framework for basis selection that the JASF graph improves compression...
متن کاملAdaptive Learning for Algorithm Selection in Classification
No learner is generally better than another learner. If a learner performs better than another learner on some learning situations, then the first learner usually performs worse than the second learner on other situations. In other words, no single learning algorithm can perform well and uniformly outperform other algorithms over all learning or data mining tasks. There is an increasing number ...
متن کاملA Maximum Matching Algorithm for Basis Selection in Spectral Learning
We present a solution to scale spectral algorithms for learning sequence functions. We are interested in the case where these functions are sparse (that is, for most sequences they return 0). Spectral algorithms reduce the learning problem to the task of computing an SVD decomposition over a special type of matrix called the Hankel matrix. This matrix is designed to capture the relevant statist...
متن کاملA Maximum Matching Algorithm for Basis Selection in Spectral Learning
We present a solution to scale spectral algorithms for learning sequence functions. We are interested in the case where these functions are sparse (that is, for most sequences they return 0). Spectral algorithms reduce the learning problem to the task of computing an SVD decomposition over a special type of matrix called the Hankel matrix. This matrix is designed to capture the relevant statist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The R Journal
سال: 2019
ISSN: 2073-4859
DOI: 10.32614/rj-2018-045